Zero-knowledge proof

Results: 211



#Item
161Complexity classes / Mathematics / Zero-knowledge proof / Interactive proof system / NP / IP / Soundness / Standard model / Cipher / Applied mathematics / Cryptographic protocols / Cryptography

Interactive Proofs under Continual Memory Leakage Prabhanjan Ananth∗ University of California, Los Angeles, USA [removed] Vipul Goyal

Add to Reading List

Source URL: eprint.iacr.org

Language: English - Date: 2014-08-24 12:01:41
162IEEE standards / Password / Zero-knowledge password proof / Challenge-response authentication / IEEE P1363 / Public-key cryptography / Password-authenticated key agreement / Password manager / Cryptography / Security / Cryptographic protocols

IEEE P1363.2: Password-based Cryptography David Jablon CTO, Phoenix Technologies NIST PKI TWG - July 30, 2003

Add to Reading List

Source URL: csrc.nist.gov

Language: English - Date: 2007-09-25 01:00:00
163Obfuscation / Obfuscated code / Homomorphic encryption / Zero-knowledge proof / RSA / ID-based encryption / Encryption / Cryptography / Ciphertext indistinguishability / Semantic security

Candidate Indistinguishability Obfuscation and Functional Encryption for all circuits Sanjam Garg UCLA [removed] Mariana Raykova

Add to Reading List

Source URL: eprint.iacr.org

Language: English - Date: 2013-07-21 10:06:46
164Cryptographic protocols / Public-key cryptography / Complexity classes / Zero-knowledge proof / Interactive proof system / Probabilistic complexity theory / RSA / NP / IP / Cryptography / Theoretical computer science / Computational complexity theory

ZERO KNOWLEDGE AND THE DEPARTMENT OF DEFENSE Susan Landau The game is simple and apparently paradoxical: Prove you know something— an ID number, an access code—without revealing even a single bit of the information i

Add to Reading List

Source URL: privacyink.org

Language: English - Date: 2011-11-13 12:10:06
165IP / Mathematics / NP / Valuation / Zero-knowledge proof / Cryptographic protocols / Applied mathematics / Proof of knowledge

Verifiable Mixing (Shuffling) of ElGamal Pairs C. Andrew Neff∗ April 21, 2004† Abstract We give an improved presentation of the protocol first published

Add to Reading List

Source URL: courses.csail.mit.edu

Language: English - Date: 2004-04-21 21:18:47
166Malleability / Semantic security / Commitment scheme / Zero-knowledge proof / Chosen-ciphertext attack / Interactive proof system / RSA / Non-interactive zero-knowledge proof / Proof of knowledge / Cryptography / Cryptographic protocols / Ciphertext indistinguishability

Construction of a Non-Malleable Encryption Scheme from Any Semantically Secure One Rafael Pass1 , abhi shelat2 , and Vinod Vaikuntanathan3 1 Cornell University

Add to Reading List

Source URL: people.csail.mit.edu

Language: English - Date: 2010-02-04 10:24:17
167Cryptographic protocols / IP / Non-interactive zero-knowledge proof / Random oracle / Interactive proof system / Proof of knowledge / Zero-knowledge proof / PP / Oracle machine / Cryptography / Theoretical computer science / Applied mathematics

Non-interactive zero-knowledge proofs in the quantum random oracle model Dominique Unruh University of Tartu July 29, 2014

Add to Reading List

Source URL: eprint.iacr.org

Language: English - Date: 2014-07-29 10:21:03
168Cryptographic protocols / Interactive proof system / Zero-knowledge proof / Proof of knowledge / NP / IP / Snark / Probabilistically checkable proof / Commitment scheme / Cryptography / Theoretical computer science / Applied mathematics

The Hunting of the SNARK∗ Nir Bitansky† Ran Canetti‡ Alessandro Chiesa§

Add to Reading List

Source URL: eprint.iacr.org

Language: English - Date: 2014-07-24 21:35:42
169Mathematics / Identity management / Cryptographic protocols / Logic in computer science / Credential / Knowledge / Mathematical proof / Modal logic / Zero-knowledge proof / Logic / Mathematical logic / Non-classical logic

Consumable Credentials in Logic-Based Access-Control Systems Kevin D. Bowers Lujo Bauer Deepak Garg Frank Pfenning

Add to Reading List

Source URL: www.ece.cmu.edu

Language: English - Date: 2012-06-20 08:58:10
170Ciphertext indistinguishability / Secure multi-party computation / Advantage / Security parameter / Commitment / One-way function / Secret sharing / Public-key cryptography / Zero-knowledge proof / Cryptography / Cryptographic protocols / Commitment scheme

Round-Efficient Black-Box Construction of Composable Multi-Party Computation Susumu Kiyoshima NTT Secure Platform Laboratories, Japan. [removed]

Add to Reading List

Source URL: eprint.iacr.org

Language: English - Date: 2014-07-16 19:58:40
UPDATE